Turing Definability in the Ershov Hierarchy

نویسندگان

  • S. Barry Cooper
  • Angsheng Li
چکیده

We obtain the first nontrivial d.c.e. Turing approximation to the class of computably enumerable (c.e.) degrees. This depends on the following extension of the splitting theorem for the d.c.e. degrees: For any d.c.e. degree a, any c.e. degree b, if b < a, then there are d.c.e. degrees x0,x1 such that b < x0,x1 < a and a = x0 ∨ x1. The construction is unusual in that it is incompatible with upper cone avoidance. A basic and intractable problem of computability theory, closely related to other longstanding questions such as Downey’s conjecture, is: At what levels of the Ershov hierarchy does Turing definability of given lower levels of the hierarchy occur? In particular, are the computably enumerable (c.e.) degrees E definable within the class of d.c.e. (= 2-c.e.) degrees E 2? An important step towards a positive answer to this latter question is the establishment of natural d.c.e. Turing approximations to E . (A Turing approximation to a class S of degrees is a Turing definable class A for which A ⊆ S or S ⊆ A.) Arslanov [1985] showed that the class of cuppable d.c.e. degrees is a d.c.e. Turing approximation to E − {0}. However, by Lachlan’s observation that every nonzero d.c.e. degree has a nonzero c.e. predecessor, this class turns out to be E 2 − {0}. We provide below a first nontrivial d.c.e. Turing approximation to the c.e. degrees, by showing that every c.e. a has the property that each d.c.e. b > a is splittable in the d.c.e. cone above a. The nontriviality follows immediately from the fact that, for instance, there is a d.c.e. degree d maximal in E 2−{0′}, by Cooper, Harrington, Lachlan, Lempp and Soare [1991]. ∗This author was partially supported by an EPSRC Research Grant, “Turing Definability”, no. GR/M 91419, and an INTAS-RFBR Research Grant, “Computability and Models”, no. 97-0139. †This author was partially supported by an EPSRC Research Grant, “Turing Definability”, No. GR/M 91419 (UK) and by NSF Grant No. 69973048 and NSF Major Grant No. 19931020 ( P. R. CHINA). 1991 Mathematics Subject Classification. Primary 03D25, 03D30; Secondary 03D35.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turing Degrees and the Ershov Hierarchy

An n-r.e. set can be defined as the symmetric difference of n recursively enumerable sets. The classes of these sets form a natural hierarchy which became a well-studied topic in recursion theory. In a series of ground-breaking papers, Ershov generalized this hierarchy to transfinite levels based on Kleene’s notations of ordinals and this work lead to a fruitful study of these sets and their ma...

متن کامل

Post's Programme for the Ershov Hierarchy

This paper extends Post’s programme to finite levels of the Ershov hierarchy of ∆2 sets. Our initial characterisation, in the spirit of Post [27], of the degrees of the immune and hyperimmune n-enumerable sets leads to a number of results setting other immunity properties in the context of the Turing and wtt-degrees derived from the Ershov hierarchy. For instance, we show that any n-enumerable ...

متن کامل

Fixed-Parameter Tractability, Definability, and Model-Checking

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order logic as generic parameterized problems and show how this approach can be useful in studying both fixed-parameter tractability and intractability. For exampl...

متن کامل

Every ∆2-Set is Natural, up to Turing Equivalence

The Turing degrees of ∆2 sets as well as the degrees of sets in certain upper segments of the Ershov hierarchy are characterized. In particular, it is shown that, up to Turing equivalence and admissible indexing, the noncomputable ∆2 sets are exactly the decision problems of countable partial orders of tree shape with branches of positive finite length only.

متن کامل

Splitting and nonsplitting in the Σ20 enumeration degrees

This paper continues the project, initiated in [ACK], of describing general conditions under which relative splittings are derivable in the local structure of the enumeration degrees, for which the Ershov hierarchy provides an informative setting. The main results below include a proof that any high total e-degree below 0′ e is splittable over any low e-degree below it, a non-cupping result in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1974